package day47_198;

/**
 * @ClassName Solution
 * @Description 198. 打家劫舍
 * @Author clockTown
 * @Date 2021/6/25 15:31
 * @Version 1.0
 */
public class Solution {
    public int rob(int[] nums) {
        //判断特例
        if (nums.length == 1) {
            return nums[0];
        }
        //建立动态规划数组
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1], nums[i] + dp[i-2]);
        }
        return dp[nums.length - 1];
    }
}
